منابع مشابه
The Geometry of Coin-Weighing Problems
Given a set of m coins out of a collection of coins of k unknown distinct weights, we wish to decide if all the m given coins have the same weight or not using the minimum possible number of weighings in a regular balance beam. Let m(n, k) denote the maximum possible number of coins for which the above problem can be solved in n weighings. We show that m(n, 2) = n 1 2 , whereas for all 3 ≤ k ≤ ...
متن کاملA New Optimal Solution Concept for Fuzzy Optimal Control Problems
In this paper, we propose the new concept of optimal solution for fuzzy variational problems based on the possibility and necessity measures. Inspired by the well–known embedding theorem, we can transform the fuzzy variational problem into a bi–objective variational problem. Then the optimal solutions of fuzzy variational problem can be obtained by solving its corresponding biobjective variatio...
متن کاملSolving optimal control problems by PSO-SVM
The optimal control of problem is about finding a control law for a given system such that a certain optimality criterion is achieved. Methods of solving the optimal control problems are divided into direct methods and mediated methods (through other equations). In this paper, the PSO- SVM indirect method is used to solve a class of optimal control problems. In this paper, we try to determine t...
متن کاملD-optimal weighing designs for four and five objects
For j = 4 and j = 5 and all d j, the maximum value of detXX , where X runs through all j d (0,1)-matrices, is determined along with a matrix X0 for which the maximum determinant is attained. In the theory of statistical designs, X0 is called a D-optimal design matrix. Design matrices that were previously thought to be D-optimal, are shown here to be D-optimal.
متن کاملSuperfast quantum algorithms for coin weighing and binary search problems
We present a class of superfast quantum algorithms that retrieve the entire contents of a quantum database Y in a single query. The class includes binary search problems and coin-weighing problems. Our methods far exceed the efficiency of classical algorithms which are bounded by the classical information-theoretic bound. We show the connection between classical algorithms based on linear hashi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of the Operations Research Society of Japan
سال: 1989
ISSN: 0453-4514,2188-8299
DOI: 10.15807/jorsj.32.56